MAX_N = 1<<15
visited=[None]*MAX_N
adj=[[{}]]*MAX_N
ans = []


def dfs(u):
  for v,e in adj[u].items():
    if(not visited[e]):
      visited[e]=True
      dfs(v)
      ans.append(e)

def solve():
  buf = ''
  n = int(input())
  for i in range((1<<n)+1):
    u = i>>1
    v= i & ((1<<n-1)-1)
    adj[u] = ({v:i})
  dfs(0)
  ans.reverse()
  for i in range(n):
    buf+='0'
  for x in ans:
    buf+=str(x%2)
  print(buf)

solve()